Fusion Layer Topological Space Query Indexing For Uncertain Data Mining

نویسنده

  • M. Kalavathi
چکیده

Data uncertainty is an intrinsic property in different applications such as sensor network monitoring, object recognition, location-based services (LBS), and moving object tracking. The data mining methods are applied to the above mentionedapplications their uncertainty has to be handled to achieve the accurate query results. The several probabilistic algorithm estimates the location and control for each object but not effective in handling query processing in distributed environments. Probabilistic inverted indexing computes the lower bound and upper bound for a threshold keyword but fails to extend the technique on tackle the correlation. In order to overcome the issues in uncertain data mining, Fusion Layer Topological Space Query Indexing technique (FLTS)is introduced. Initially, the queries are articulated on any random subset of attributes in the uncertain data.The FLTS index technique answers the top-k queries competently. FLTS index correctlyshows in their dominant relationships andsignificantly reduces the number of tuple accessed through query processing by pruning redundant tuple based on two criterions such as layer point sort method and the record point sort method. Initially, layer point sort method is used in FLTS indexto sort out tuple totally on the combination of all attribute values of the tuple. Subsequently, each attributes values particularly used for rating the tuple using record point sort method. Therefore,the correlation is removed significantly. Through an analysis of the interaction of the two sorting methods, derive a fixed bound that reduces the number of tuple retrieved during query processing and obtaining the correct query results in distributed environments. An experimental result shows that the FLTS indexing technique improves the query retrieving efficiency, response time, memory consumption and scalability.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-zero probability of nearest neighbor searching

Nearest Neighbor (NN) searching is a challenging problem in data management and has been widely studied in data mining, pattern recognition and computational geometry. The goal of NN searching is efficiently reporting the nearest data to a given object as a query. In most of the studies both the data and query are assumed to be precise, however, due to the real applications of NN searching, suc...

متن کامل

A Semantic Fusion Approach Between Medical Images and Reports Using UMLS

One of the main challenges in content-based image retrieval still remains to bridge the gap between low-level features and semantic information. In this paper, we present our first results concerning a medical image retrieval approach using a semantic medical image and report indexing within a fusion framework, based on the Unified Medical Language System (UMLS) metathesaurus. We propose a stru...

متن کامل

MUD: Mapping-based query processing for high-dimensional uncertain data

Many real-world applications require management of uncertain data that are modeled as objects in high-dimensional space with imprecise values. In such applications, data objects are typically associated with probability density functions. A fundamental operation on such uncertain data is the probabilistic-threshold range query (PTRQ), which retrieves the objects appearing in the query region wi...

متن کامل

Modeling spatial uncertainties in geospatial data fusion and mining

Geospatial data analysis relies on Spatial Data Fusion and Mining (SDFM), which heavily depend on topology and geometry of spatial objects. Capturing and representing geometric characteristics such as orientation, shape, proximity, similarity, and their measurement are of the highest interest in SDFM. Representation of uncertain and dynamically changing topological structure of spatial objects ...

متن کامل

Probabilistic Threshold Indexing for Uncertain Strings

Strings form a fundamental data type in computer systems. String searching has been extensively studied since the inception of computer science. Increasingly many applications have to deal with imprecise strings or strings with fuzzy information in them. String matching becomes a probabilistic event when a string contains uncertainty, i.e. each position of the string can have different probable...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2016